Reversible session-based pi-calculus

In this work, we incorporate reversibility into structured communication-based programming, to allow parties of a session to automatically undo, ina rollback fashion, the effect of previously executed interactions. This per-mits to take different computation paths along the same session, as wellas to revert the whole session and starting a new one. Our aim is to de-fine a theoretical basis for examining the interplay in concurrent systemsbetween reversible computation and session-based interaction. We thus pro-pose ReSπ, a session-based variant of π-calculus using memory devices tokeep track of the computation history of sessions in order to reverse it. Weshow how a session type discipline of π-calculus is extended to ReSπ, andillustrate its practical advantages for static verification of safe compositionin communication-centric distributed software performing reversible compu-tations. We also show how a fully reversible characterisation of the calculusextends to commitable sessions, where computation can go forward and back-ward until the session is committed by means of a specific irreversible action.